Forward Reasoning via Sequential Queries in Logic Programming
نویسنده
چکیده
Most Prolog implementations are based on backward chaining techniques. However, there are many applications in which forward chaining ones are desirable such as in dynamic programming. In this paper, we first introduce a variant of a Prolog interpreter that computes interpolations and then introduce the notion of sequential queries. These two notions allow a combination of both forms of reasoning in Prolog.
منابع مشابه
Anytime Inference in Probabilistic Logic Programs with Tp-Compilation
Existing techniques for inference in probabilistic logic programs are sequential: they first compute the relevant propositional formula for the query of interest, then compile it into a tractable target representation and finally, perform weighted model counting on the resulting representation. We propose TP -compilation, a new inference technique based on forward reasoning. TP -compilation pro...
متن کاملTowards a Decidable LogicWeb via Length-Bounded Derivations
LogicWeb has traditionally lacked devices for dealing with intractable queries. We address this limitation by adopting length-bounded inference, a form of approximate reasoning. A length-bounded inference is of the form pv(P, G, n) which is a success if a query G can be proved from the web page P within n proof steps. It thus makes LogicWeb decidable and more tractable. During the process, we p...
متن کاملTP-Compilation for inference in probabilistic logic programs
We propose TP-compilation, a new inference technique for probabilistic logic programs that is based on forward reasoning. TP-compilation proceeds incrementally in that it interleaves the knowledge compilation step for weighted model counting with forward reasoning on the logic program. This leads to a novel anytime algorithm that provides hard bounds on the inferred probabilities. The main diff...
متن کاملThe draculasp System: Default Reasoning about Actions and Change Using Logic and Answer Set Programming
We present an implementation for nonmonotonic reasoning about action domains. Its name draculasp stands for “default reasoning about actions and change using logic and answer set programming.” The system compiles action domain specifications from a logic-based input language into answer set programs and invokes an ASP solver to answer queries about the domain. Intelligent agents can use dracula...
متن کاملLogical frameworks for specifying and reasoning about stateful and concurrent languages∗
Substructural logics, such as linear logic and ordered logic, have an inherent notion of state and state change. This makes them a natural choice for developing logical frameworks that specify evolving stateful systems. Our previous work has shown that the so-called forward reasoning fragment of ordered linear logic can be used to give clear, concise, and modular specifications of stateful and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- ITC
دوره 41 شماره
صفحات -
تاریخ انتشار 2012